Min-max and min-min stackelberg strategies with closed-loop information structure

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Min-min Max-min Algorithm with Improved Performance

The high cost of supercomputers and the need for large-scale computational resources has led to the development of network of computational resources known as Grid. To better use tremendous capabilities of this large scale distributed system, effective and efficient scheduling algorithms are needed. Many such algorithms have been designed and implemented. We introduce a new scheduling algorithm...

متن کامل

Min-max-min robust combinatorial optimization

The idea of k-adaptability in two-stage robust optimization is to calculate a fixed number k of second-stage policies here-and-now. After the actual scenario is revealed, the best of these policies is selected. This idea leads to a min-max-min problem. In this paper, we consider the case where no first stage variables exist and propose to use this approach to solve combinatorial optimization pr...

متن کامل

Min-max-min Geometric Facility Location Problems

We propose algorithms for a special type of geometric facility location problem in which customers may choose not to use the facility. We minimize the maximum cost incurred by a customer, where the cost itself is a minimum between two costs, according to whether the facility is used or not. We therefore call this type of location problem a min-max-min geometric facility location problem. As a f...

متن کامل

Max-Min averaging operator: fuzzy inequality systems and resolution

 Minimum and maximum operators are two well-known t-norm and s-norm used frequently in fuzzy systems. In this paper, two different types of fuzzy inequalities are simultaneously studied where the convex combination of minimum and maximum operators is applied as the fuzzy relational composition. Some basic properties and theoretical aspects of the problem are derived and four necessary and suffi...

متن کامل

Min, Max, and Sum

This paper provides characterization theorems for preferences that can be represented by U(x1, ..., xn)=min{xk}, U(x1, ..., xn)=max{xk}, U(x1, ..., xn)=; u(xk), or combinations of these functionals. The main assumption is partial separability, where changing a common component of two vectors does not reverse strict preferences, but may turn strict preferences into indifference. We discuss appli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Dynamical and Control Systems

سال: 2011

ISSN: 1079-2724,1573-8698

DOI: 10.1007/s10883-011-9123-2